On a question regarding visibility of lattice points--III

نویسندگان

  • Sukumar Das Adhikari
  • Yong-Gao Chen
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Remarks on the Visibility Problem in the Function Field Case

We extend results of [1, 2, 3] on the visibility problem for lattice points in Zd to the case of function fields over finite fields which are related to important questions regarding the corresponding q-Jacobsthal function. Résumé. Nous étendons résultats de [1, 2, 3] sur le probleme de la visibilité des points du réseau entier Zd au cas des corps de fonctions sur un corps fini, en rapport avec...

متن کامل

Visibility in the Plane

We find the size of the smallest subset of the set of integer lattice points, such that every element of a given rectangular grid is visible from our subset, which in particular answers a question of Paul Erdős et al.

متن کامل

Spatial statistics for lattice points on the sphere I‎: ‎Individual results

‎We study the spatial distribution of point sets on the sphere obtained from the representation of a large integer as a sum of three integer squares‎. ‎We examine several statistics of these point sets‎, ‎such as the electrostatic potential‎, ‎Ripley's function‎, ‎the variance of the number of points in random spherical caps‎, ‎and the covering radius‎. ‎Some of the results are conditional on t...

متن کامل

Non-Euclidean visibility problems

Consider in R2 the standard lattice L = Z×Z and the origin (0,0). A point (m,n) ∈ L−{(0,0)} is said to be visible if the segment connecting the origin and (m,n) does not contain any other lattice points. Visibility problems have been studied since a century. Perhaps the most celebrated problems are the visible version of Gauss circle problem and the so-called orchard problem (see other problems...

متن کامل

Approximate Visibility for Illumination Computations using Point Clouds

In this paper, we present a simple technique to evaluate the visibility between pairs of points in a scene. In most current rendering algorithms, visibility queries are evaluated exactly. Our approach approximates the visibility value between two points using a point cloud representation of the surfaces in the scene. The computed value is a function of the distance and orientation of points in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 259  شماره 

صفحات  -

تاریخ انتشار 2002